A new non-orthogonal space-time code with low decoding complexity

Space-time block codes with low maximum-likelihood decoding complexity

A new lattice decoding for space time block codes with low complexity

We present an algorithm based on the closest point search (CPS) in lattices for decoding of space-time block codes (STBC). The modified CPS algorithm based on the Schnorr-Euchner variation of the Pohst method is used to perform the decoding of STBC. This method is shown to be substantially faster than other known sphere decoding methods. Also we exploit a fast method for decoding of orthogonal ...

A quasi-orthogonal space-time block code

It has been shown that a complex orthogonal design that provides full diversity and full transmission rate for a space–time block code is not possible for more than two antennas. Previous attempts have been concentrated in generalizing orthogonal designs which provide space–time block codes with full diversity and a high transmission rate. In this work, we design rate one codes which are quasi-...

Low-Complexity Iterative Detection for Orthogonal Time Frequency Space Modulation

We elaborate on the recently proposed orthogonal time frequency space (OTFS) modulation technique, which provides significant advantages over orthogonal frequency division multiplexing (OFDM) in Doppler channels. We first derive the input–output relation describing OTFS modulation and demodulation (mod/demod) for delay–Doppler channels with arbitrary number of paths, with given delay and Dopple...

Quasi-Orthogonal Space-Time Block Code

Quasi-Orthogonal Space-Time Block Code presents an up-to-date, comprehensive and in-depth discussion of an important emerging class of space-time codes, called the Quasi-Orthogonal STBC (QO-STBC). Used in Multiple-Input Multiple-Output (MIMO) communication systems, they provide transmit diversity with higher code rates than the well-known orthogonal STBC (OSTBC), yet at lower decoding complexit...